An Approximation Algorithm for the Art Gallery Problem
نویسندگان
چکیده
Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The point-guard art gallery problem asks for a minimum set S such that every point in P is visible from a point in S. Assuming integer coordinates and a special general position assumption, we present the first O(log OPT)-approximation algorithm for the point guard art gallery problem. This algorithm combines ideas of Efrat and Har-Peled [7] and Deshpande et al. [3, 4]. In addition, we point out a mistake in the latter.
منابع مشابه
A Pseudo - Polynomial Time O ( log 2 n ) - Approximation Algorithm for Art Gallery Problems
Master of Science in Mechanical Engineering and Master of Science in Electrical Engineering and Computer Science In this thesis, we give a pseudo-polynomial time o (log2 n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and their positions so that guards located at these points cover...
متن کاملAn Approximation Algorithm For Point Guard Problem
In 1973, Victor Klee posed the following question: How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This resulted in many subsequent researches so that the various versions of the art gallery problem were posed. Most of the versions posed are NP-hard, so designing approximation algorithms becomes important. The b...
متن کاملMaximizing the Guarded Interior of an Art Gallery
In the Art Gallery problem a polygon is given and the goal is to place as few guards as possible so that the entire area of the polygon is covered. We address a closely related problem: how to place a fixed number of guards on the vertices or the edges of a simple polygon so that the total guarded area inside the polygon is maximized. Recall that an optimization problem is called APX-hard, if t...
متن کاملA Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the number of walls of the art gallery and the spread ∆, which is defined as the ratio between the longest and shortest pairwise distances. Our algorithm is pseudopolynomial in the sense that it is polynomial in the spre...
متن کاملApproximability of guarding weak visibility polygons
The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P , is fully guarded. In 1998, the problems of finding the minimum number of point guards, vertex guards, and edge guards required to guard P were shown to be APX-hard by Eidenbenz, Widmayer and Stamm. In 1987, Ghosh presented approximation algorithms for...
متن کامل